全文获取类型
收费全文 | 302篇 |
免费 | 43篇 |
国内免费 | 7篇 |
专业分类
化学 | 61篇 |
力学 | 3篇 |
综合类 | 8篇 |
数学 | 265篇 |
物理学 | 15篇 |
出版年
2023年 | 2篇 |
2022年 | 9篇 |
2021年 | 12篇 |
2020年 | 9篇 |
2019年 | 11篇 |
2018年 | 8篇 |
2017年 | 14篇 |
2016年 | 5篇 |
2015年 | 8篇 |
2014年 | 24篇 |
2013年 | 22篇 |
2012年 | 17篇 |
2011年 | 20篇 |
2010年 | 20篇 |
2009年 | 20篇 |
2008年 | 21篇 |
2007年 | 29篇 |
2006年 | 16篇 |
2005年 | 15篇 |
2004年 | 13篇 |
2003年 | 15篇 |
2002年 | 8篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1986年 | 4篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有352条查询结果,搜索用时 31 毫秒
41.
在Kyle模型中引入两个异质的内部交易者,利用理论模型推导的方式探讨他们是否会进行信息共享.研究发现在均衡状态下,内部交易者的期望利润是关于信息共享数量的减函数.当两个内部交易者不分享任何信息时,他们的期望利润能达到最大值;内部交易者没有动机进行信息共享. 相似文献
42.
《组合设计杂志》2018,26(3):119-126
A pair of disjoint collections of k‐subsets (blocks) of a set V of cardinality v is called a t‐ trade or simply a t‐trade if every t‐subset of V is included in the same number of blocks of T0 and T1. The cardinality of T0 is called the volume of the trade. Using the weight distribution of the Reed–Muller code, we prove the conjecture that for every i from 2 to t, there are no t‐trades of volume greater than and less than and derive restrictions on the t‐trade volumes that are less than . 相似文献
43.
Aleš Drápal 《Discrete Applied Mathematics》2010,158(14):1479-1495
We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and down-oriented triangles as different. We computationally prove Tutte’s conjecture that the smallest perfect dissection has size 15 and we find all perfect dissections up to size 20. 相似文献
44.
We report the synthesis of 1,4,8-triazaspiro[4.5]decan-2-one derivatives from N-benzyl-4-piperidone and N-protected amino acid amides on solid support. We have translated the chemistry from solution to solid phase using a backbone amide linker (BAL) mimic. Using a parallel combinatorial approach, we performed the optimization of the synthesis on SynPhase™ Lanterns. 相似文献
45.
Composite membranes were prepared by (a) infiltrating NAFION with SiO2-P2O5-ZrO2 sol, and (b) recasting a film using NAFION solution containing SiO2-P2O5-ZrO2 sol. The membranes were characterized by Differential Thermal Analysis and ac-impedance spectroscopy as a function of relative humidity. The influences of the heat treatment (80°C–150°C) and cleaning on the electrical properties were investigated. The incorporation of SiO2-P2O5-ZrO2 gels into NAFION lead to improvements in its thermal stability and proton conductivity. 相似文献
46.
Takayoshi Fujii Tomoyoshi Takano Hiroyuki Morita Toshiaki Yoshimura 《Tetrahedron》2006,62(41):9622-9627
The fluorination of 10-oxo-10H-5λ4,10λ4-thianthren-5-ylideneamine (2) with Selectfluor™ affords 5-fluoro-10-oxo-5,10-dihydro-5λ6,10λ4-thianthren-5-nitrile (4). The amination of 4 with morpholine gives 5-morpholino-10-oxo-5,10-dihydro-5λ6,10λ4-thianthren-5-nitrile (5). The stereochemical course of both reactions has been studied, while the configurations of their products, cis-isomer 4 and trans-5-morpholino-10-oxo-5,10-dihydro-5λ6,10λ4-thianthren-5-nitrile (trans-5) are elucidated by the use of X-ray crystallographic analyses. 相似文献
47.
Joe Zhu 《Annals of Operations Research》1996,66(5):311-335
This article employs new data envelopment analysis/assurance region (DEA/AR) methods to evaluate the efficiency of the 35 textile factories of the Nanjing Textiles Corporation (NTC), Nanjing, China. The returns to scale (RTS) of these factories were studied without assuming that the optimal DEA solutions were unique. All DMUs are identified with pointsE (Extreme Efficient),E (Efficient but not an extreme point) andF (Frontier but not efficient). We then further identify the nonfrontier DMUs with pointsNE, NE andNF according to whether they are projected onto a point inE, E, orF en route to evaluating their performances. All of the inefficient factories were in classNF and had unique optimal primal-dual solution pairs. Consequently, the solution pairs satisfy the strong complementary slackness condition (SCSC). Application of cone-ratio (CR) ARs reduced significantly the number of factories in classE, and showed that some AR-efficient factories were more flexible in adopting the mixture of central planning and market economies that China currently is trying to use. Also, linked-cone (LC) ARs were applied to measure maximum and minimum profit ratios. The SCSC multiplier space approach was utilized to analyze the sensitivity of the efficiency results to potential errors in the data with and without ARs. The results in this article suggest that collective units had a better performance than state-owned units in the two consecutive years analyzed.This paper was written while the author was at the School of Economics and Management, Southeast University, Nanjing 210018, P.R. China. 相似文献
48.
本对献[1]在利润敏感性分析中关于利润线为直线,利润增量与产品的单价增量成正比的提法提出了异议。作指出:产品单价的变动要影响到产品的销售量,提高产品的单价并不一定能够增加企业的利润,最后本还结合实例说明了这一观点。 相似文献
49.
“技术增加值”评价原理与方法 总被引:3,自引:0,他引:3
提出了"技术增加值"的概念,认为公司价值不仅包括"经济增加值",还应包括"技术增加值".在系统地比较了"经济增加值"与"技术增加值"两个概念和形成过程的基础上,给出了技术增加值的评价模型、评价方法和评价步骤,最后通过两个应用示例予以说明.提出应用"技术增加值"指标,更加客观反映企业的全面价值和业绩. 相似文献
50.
We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor’s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem. 相似文献